Computation of Pseudospectra by Continuation

نویسنده

  • S. H. Lui
چکیده

The concept of pseudospectrum was introduced by L. N. Trefethen to explain the behavior of nonnormal operators. Many phenomena (for example, hydrodynamic instability and convergence of iterative methods for linear systems) cannot be accounted for by eigenvalue analysis but are more understandable by examining the pseudospectra. The straightforward way to compute pseudospectra involves many applications of the singular value decomposition. This paper presents several fast continuation methods to calculate pseudospectra of diierent types of matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Field of Values and Pseudospectra Using the Lanczos Method with Continuation*

The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes . To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm . We desc...

متن کامل

On the Pseudospectra of Matrix Polynomials

The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights into the sensitivity of eigenvalues under perturbations, and have several applications. First, qualitative properties concerni...

متن کامل

Properties and computations of matrix pseudospectra

Pseudospectra were introduced as early as 1975 and became popular tool during the 1990s.In this paper, we give a new definition of pseudospectra by using QR decomposition. Some properties of pseduospectra are explored and an algorithm for the computation of pseduospectra is given.

متن کامل

Pseudospectra of rectangular matrices

Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...

متن کامل

A reduced basis approach to large-scale pseudospectra computation

For studying spectral properties of a non-normal matrix A ∈ Cn×n, information about its spectrum σ(A) alone is usually not enough. Effects of perturbations on σ(A) can be studied by computing ε-pseudospectra, that is the level-sets of the resolvent norm function g(z) = ‖(zI−A)‖2. The computation of ε-pseudospectra requires determining the smallest singular values σmin(zI − A) on for all z on a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1997